Commitment scheme

Results: 216



#Item
21Private Client-Side Profiling with Random Forests and Hidden Markov Models George Danezis1 , Markulf Kohlweiss1 , Benjamin Livshits1 , and Alfredo Rial2 1  2

Private Client-Side Profiling with Random Forests and Hidden Markov Models George Danezis1 , Markulf Kohlweiss1 , Benjamin Livshits1 , and Alfredo Rial2 1 2

Add to Reading List

Source URL: www0.cs.ucl.ac.uk

Language: English - Date: 2013-10-10 06:48:57
22Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique∗ (Technical report – September 11, 2013) Luís T. A. N. Brandão† University of Lisbon

Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique∗ (Technical report – September 11, 2013) Luís T. A. N. Brandão† University of Lisbon

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2013-09-12 00:27:33
23LNCSRobuster Combiners for Oblivious Transfer

LNCSRobuster Combiners for Oblivious Transfer

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:36:33
24Non-Black-Box Techniques in Cryptography Thesis for the Ph.D. Degree by  Boaz Barak

Non-Black-Box Techniques in Cryptography Thesis for the Ph.D. Degree by Boaz Barak

Add to Reading List

Source URL: www.boazbarak.org

Language: English - Date: 2011-10-10 23:53:13
25Covert Two-Party Computation Carnegie Mellon University 5000 Forbes Ave Pittsburgh, PANicholas Hopper

Covert Two-Party Computation Carnegie Mellon University 5000 Forbes Ave Pittsburgh, PANicholas Hopper

Add to Reading List

Source URL: hunch.net

Language: English - Date: 2005-03-01 11:04:04
26LNCSOn Robust Combiners for Private Information Retrieval and Other Primitives

LNCSOn Robust Combiners for Private Information Retrieval and Other Primitives

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:36:31
27Very-efficient simulatable flipping of many coins into a well (and a new very-efficient extractable-and-equivocable commitment scheme) Luís T. A. N. Brandão∗ (Technical report – June 28, Abstract. Secure two

Very-efficient simulatable flipping of many coins into a well (and a new very-efficient extractable-and-equivocable commitment scheme) Luís T. A. N. Brandão∗ (Technical report – June 28, Abstract. Secure two

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-06-28 21:51:08
28Very-efficient flipping of many coins (between two parties) Luís T. A. N. Brandão University of Lisbon and Carnegie Mellon University

Very-efficient flipping of many coins (between two parties) Luís T. A. N. Brandão University of Lisbon and Carnegie Mellon University

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2014-03-01 16:01:06
29Privacy-Preserving Observation in Public Spaces Florian Kerschbaum1 and Hoon Wei Lim2 1 SAP Karlsruhe, Germany

Privacy-Preserving Observation in Public Spaces Florian Kerschbaum1 and Hoon Wei Lim2 1 SAP Karlsruhe, Germany

Add to Reading List

Source URL: www.fkerschbaum.org

Language: English - Date: 2015-06-23 05:52:39
30

PDF Document

Add to Reading List

Source URL: seclab.stanford.edu

Language: English - Date: 2010-07-17 01:14:13